منابع مشابه
Writing Constructive Proofs Yielding Efficient Extracted Programs
The NuPRL system [3] was designed for interactive writing of machine–checked constructive proofs and for extracting algorithms from the proofs. The extracted algorithms are guaranteed to be correct 1 which makes it possible to use NuPRL as a programming language with built-in verification[1,5,7,8,9,10]. However it turned out that proofs written without algorithmic efficiency in mind often produ...
متن کاملWriting Programs that Run EveryWare on the Computational Grid
ÐThe Computational Grid [12] has been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to aggregate ensembles of shared, heterogeneous, and distributed resources (potentially controlled by separate organizations) to provide computational apowero to an application program. In this paper, we provid...
متن کاملATS/LF: A type system for construct- ing proofs as total functional programs
The development of Applied Type System (ATS) [36, 31] stems from an earlier attempt to introduce dependent types into practical programming [38, 37]. While there is already a framework Pure Type System [4] (PTS) that offers a simple and general approach to designing and formalizing type systems, it has been understood that there are some acute problems with PTS that make it difficult to support...
متن کاملContracting proofs to programs
This work describes a family of homomorphisms that contract natural deductions into typed ^-expressions, with the property that a convergence proof for an untyped program for function / is contracted to a typed program for /. The main novelties, compared to previous works on extracting algorithms from proofs, are the reading of deductions themselves as programs, and that instead of a constructi...
متن کاملFeasible Programs from Proofs
We restrict induction and recursion on notation in all nite types so as to characterize the polynomial time computable functions. The restrictions are obtained by enriching the type structure with the formation of types (and formulas A (B as well as 8 x A with \complete" variables x, and by adding linear concepts to the lambda calculus (for object terms and proof terms). For the arithmetical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 1985
ISSN: 0168-7433,1573-0670
DOI: 10.1007/bf00244273